Efficient Priority Assignment Policies for Distributed Real-Time Database Systems
نویسندگان
چکیده
A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an improved priority assignment policy named Flexible High Reward with concurrency control factor (FHR-CF) is proposed to reduce the MissRatio and WastedRatio. Key-word: priority assignment policy, real-time transaction scheduling, concurrency control factor, real-time database systems
منابع مشابه
Some Performance Issues in Distributed Real Time Database Systems
Database performance is an important aspect of database usability. Distributed real time database systems (DRTDBS) must be designed on all levels of database architecture to support timely execution of requests. The primary performance objective in DRTDBS is to minimize the number of missed deadlines. Due to the demanding nature of this objective, traditional approaches are inadequate. However,...
متن کاملPriority Assignment for Sub-transaction in Distributed Real-time Databases
Recent studies on deadline assignment to sub-tasks in distributed real-time systems have suggested different heuristics for priority assignment to improve the system performance [6,10]. These heuristics only consider the real-time constraints of the tasks and may not be suitable for distributed real-time database systems (DRTDBS). In this paper, we examine the performance of these heuristics fo...
متن کاملImpact of priority assignment on optimistic concurrency control in distributed real-time databases
In the studies of real-time concurrency control protocols (RT-CCPs), it is always assumed that earliest deadline first (EDF) is employed as the CPU scheduling algorithm. However, using purely (ultimate) deadline for priority assignment may not be suitable for distributed real-time database systems (DRTDBS) in which there exist different kinds of transactions, such as global and local transactio...
متن کاملCombining EDF and FP in Distributed Real-Time Systems: Schedulability Analysis and Optimization
The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only on...
متن کاملAn Optimal Fixed-Priority Assignment Algorithm for Supporting Fault-Tolerant Hard Real-Time Systems
The main contribution of this paper is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant hard real-time systems. We consider systems that make use of error-recovery techniques to carry out fault tolerance. Second, we propose a new priority assignment algorithm which can be used, together with the schedulability anal...
متن کامل